Solving Travelling Salesman Problem Using Hybrid Fluid Genetic Algorithm (HFGA)
نویسندگان
چکیده
منابع مشابه
Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm
We present an improved hybrid genetic algorithm to solve the two-dimensional Euclidean traveling salesman problem (TSP), in which the crossover operator is enhanced with a local search. The proposed algorithm is expected to obtain higher quality solutions within a reasonable computational time for TSP by perfectly integrating GA and the local search. The elitist choice strategy, the local searc...
متن کاملSolving Travelling Salesman Problem using Clustering Genetic Algorithm
Solving NP hard problem like Travelling Salesman Problem (TSP) is a major challenge faced by analysts even though many techniques are available. Many versions of Genetic Algorithms are introduced by researchers to improve its performance in solving TSP. Clustering Genetic Algorithm (CGA) was recently introduced and this paper analyzes the results obtained by implementing it for TSP. It is obser...
متن کاملThe Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm
The ordered clustered travelling salesman problem is a variation of the usual travelling salesman problem in which a set of vertices (except the starting vertex) of the network is divided into some prespecified clusters. The objective is to find the least cost Hamiltonian tour in which vertices of any cluster are visited contiguously and the clusters are visited in the prespecified order. The p...
متن کاملSolving Asymmetric Travelling Salesman Problem using Memetic Algorithm
Memetic Algorithms have been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for Asymmetric Traveling salesman problem (ATSP). Memetic Algorithm is a combination of power of Genetic algorithm with the powerful local search technique to focus on the population of local optima. Because of perfor...
متن کاملMoving Target Travelling Salesman Problem using Genetic Algorithm
In this paper, the Moving Target Travelling Salesman Problem (MTTSP) is described. In MTTSP, several sites are required to be visited which are moving with constant velocity in different directions. The distance of the sites from origin, velocity and the angle of movement are known in advance. The goal is to find the fastest tour starting and ending at the origin which intercepts all the sites....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pamukkale University Journal of Engineering Sciences
سال: 2019
ISSN: 1300-7009,2147-5881
DOI: 10.5505/pajes.2018.81084